Smoothing approximations to nonsmooth optimization problems
نویسندگان
چکیده
منابع مشابه
Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
In this paper, we propose a smoothing augmented Lagrangian method for finding a stationary point of a nonsmooth and nonconvex optimization problem. We show that any accumulation point of the iteration sequence generated by the algorithm is a stationary point provided that the penalty parameters are bounded. Furthermore, we show that a weak version of the generalized Mangasarian Fromovitz constr...
متن کاملSmoothing-Nonsmooth Reformulations of Variational Inequality Problems
It has long been known that variational inequality problems can be reformulated as nonsmooth equations. Recently, locally high-order convergent nonsmooth Newton methods for nonsmooth equations have been well established via the concept of semismoothness. In this paper, we focus our discussions on a way of globalizing nonsmooth Newton methods based on a smoothing-nonsmooth reformulation of nonsm...
متن کاملA Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
We study a smoothing Newton method for solving a nonsmooth matrix equation that includes semidefinite programming and the semidefinite complementarity problem as special cases. This method, if specialized for solving semidefinite programs, needs to solve only one linear system per iteration and achieves quadratic convergence under strict complementarity and nondegeneracy. We also establish quad...
متن کاملTractable Approximations to Robust Conic Optimization Problems
In earlier proposals, the robust counterpart of conic optimization problems exhibits a lateral increase in complexity, i.e., robust linear programming problems (LPs) become second order cone problems (SOCPs), robust SOCPs become semidefinite programming problems (SDPs), and robust SDPs become NP-hard. We propose a relaxed robust counterpart for general conic optimization problems that (a) prese...
متن کاملSolving Variational Inequality Problems via Smoothing-Nonsmooth Reformulations
It has long been known that variational inequality problems can be reformulated as nonsmooth equations. Recently, locally high-order convergent Newton methods for nonsmooth equations have been well established via the concept of semismoothness. When the constraint set of the variational inequality problem is a rectangle, several locally convergent Newton methods for the reformulated nonsmooth e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1995
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000010444